Edward Ochmanski

According to our database1, Edward Ochmanski authored at least 29 papers between 1985 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Hierarchy of persistence with respect to the length of action's disability.
CoRR, 2015

2013
On persistent reachability in Petri nets.
Inf. Comput., 2013

2012
Hierarchy of persistency with respect to the length of actions disability.
Proceedings of the International Workshop on Petri Nets and Software Engineering, 2012

2009
Levels of Persistency in Place/Transition Nets.
Fundam. Informaticae, 2009

2008
On Trace-Expressible Behaviour of Petri Nets.
Fundam. Informaticae, 2008

2007
On Ethics of Mazurkiewicz Traces.
Fundam. Informaticae, 2007

On Star-Free Trace Languages and their Lexicographic Representations.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

A Star Operation for Star-Free Trace Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Star-free Star and Trace Languages.
Fundam. Informaticae, 2006

Trace Nets and Conflict-free Computations.
Fundam. Informaticae, 2006

2005
On Star-Connected Flat Languages.
Fundam. Informaticae, 2005

2004
Best Fairness Hierarchy in Elementary Nets.
Fundam. Informaticae, 2004

Covering Fairness against Conspiracies.
Proceedings of the Applications and Theory of Petri Nets 2004, 2004

1995
Recognizable Trace Languages.
Proceedings of the Book of Traces, 1995

1993
On Regular Compatibility of Semi-Commutations.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Decidability of the Star Problem in A* x {b}*.
Inf. Process. Lett., 1992

Modelling Concurrency with Semi-Commutations.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1990
On confluent semi-commutations: decidability and complexity results
Forschungsberichte, TU Munich, 1990

Inevitability in diamond processes.
RAIRO Theor. Informatics Appl., 1990

Notes on a star mystery.
Bull. EATCS, 1990

Semi-Commutation and Deterministic Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989
Concurrent Systems and Inevitability.
Theor. Comput. Sci., 1989

Semi-commutation for P-T Systems.
Bull. EATCS, 1989

1988
On Morphisms of Trace Monoids.
Proceedings of the STACS 88, 1988

1987
Inevitability in Concurrent Systems.
Inf. Process. Lett., 1987

On Lexicographic Semi-Commutations.
Inf. Process. Lett., 1987

A non-invertible PCF language.
Bull. EATCS, 1987

Occurrence Traces: Processes of Elementary Net Systems.
Proceedings of the Advances in Petri Nets 1988, 1987

1985
Regular behaviour of concurrent systems.
Bull. EATCS, 1985


  Loading...