Maciej Koutny

According to our database1, Maciej Koutny authored at least 186 papers between 1984 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Reversible computation vs. reversibility in Petri nets.
Sci. Comput. Program., 2018

Reversing Transitions in Bounded Petri Nets.
Fundam. Inform., 2018

Reaction Mining for Reaction Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Reaction Systems, Transition Systems, and Equivalences.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

An Efficient Characterization of Petri Net Solvable Binary Words.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

Visualising Data Sets in Structured Occurrence Nets.
Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'18), 2018

SONCraft: A Tool for Construction, Simulation, and Analysis of Structured Occurrence Nets.
Proceedings of the 18th International Conference on Application of Concurrency to System Design, 2018

2017
Applying regions.
Theor. Comput. Sci., 2017

Signal set tissue systems and overlapping localities.
Theor. Comput. Sci., 2017

Evolving reaction systems.
Theor. Comput. Sci., 2017

An extension of the taxonomy of persistent and nonviolent steps.
Inf. Sci., 2017

Verification of Linear-Time Temporal Properties for Reaction Systems with Discrete Concentrations.
Fundam. Inform., 2017

Invariant Structures and Dependence Relations.
Fundam. Inform., 2017

Alphabets of Acyclic Invariant Structures.
Fundam. Inform., 2017

Methods for Distributed and Concurrent Systems: Special Issue on the occasion of the 60th Birthday of Professor Gabriel Ciobanu.
Fundam. Inform., 2017

Adding A/Sync Places to the Synthesis Procedure for Whole-Place Operations Nets with Localities.
Sci. Ann. Comp. Sci., 2017

On Synthesising Step Alphabets for Acyclic Invariant Structures.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2017 Satellite event of the conferences: 38th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2017 and 17th International Conference on Application of Concurrency to System Design ACSD 2017, 2017

2016
Modeling biological gradient formation: combining partial differential equations and Petri nets.
Natural Computing, 2016

Formal verification of secure information flow in cloud computing.
J. Inf. Sec. Appl., 2016

Step traces.
Acta Inf., 2016

Towards Quantitative Verification of Reaction Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2016

Reversible Computation vs. Reversibility in Petri Nets.
Proceedings of the Reversible Computation - 8th International Conference, 2016

Synthesis of Petri Nets with Whole-Place Operations and Localities.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2016, 2016

Reversing Transitions in Bounded Petri Nets.
Proceedings of the 25th International Workshop on Concurrency, 2016

From Petri Nets with Shared Variables to ITL.
Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015
Characterising Concurrent Histories.
Fundam. Inform., 2015

Persistent and Nonviolent Steps and the Design of GALS Systems.
Fundam. Inform., 2015

Strategy based semantics for mobility with time and access permissions.
Formal Asp. Comput., 2015

PerTiMo: A Model of Spatial Migration with Safe Access Permissions.
Comput. J., 2015

Opacity in Internet of Things with Cloud Computing (Short Paper).
Proceedings of the 8th IEEE International Conference on Service-Oriented Computing and Applications, 2015

Order Structures for Subclasses of Generalised Traces.
Proceedings of the Language and Automata Theory and Applications, 2015

Unfolding CSPT-nets.
Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'15), 2015

Non-atomic Transition Firing in Contextual Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2015

2014
Tissue Systems and Petri Net Synthesis.
Trans. Petri Nets and Other Models of Concurrency, 2014

Folded Hasse diagrams of combined traces.
Inf. Process. Lett., 2014

A Flow Sensitive Security Model for Cloud Computing Systems.
CoRR, 2014

Data Resources in Dynamic Environments.
Proceedings of the 2014 Theoretical Aspects of Software Engineering Conference, 2014

Interval Temporal Logic Semantics of Box Algebra.
Proceedings of the Language and Automata Theory and Applications, 2014

Verifying Secure Information Flow in Federated Clouds.
Proceedings of the IEEE 6th International Conference on Cloud Computing Technology and Science, 2014

Performance Modelling and Evaluation of Enterprise Information Security Technologies.
Proceedings of the 14th IEEE International Conference on Computer and Information Technology, 2014

2013
Causality in Extensions of Petri Nets.
Trans. Petri Nets and Other Models of Concurrency, 2013

A complete proof system for propositional projection temporal logic.
Theor. Comput. Sci., 2013

ITL semantics of composite Petri nets.
J. Log. Algebr. Program., 2013

Mutex Causality in Processes and Traces of General Elementary Nets.
Fundam. Inform., 2013

Step semantics of boolean nets.
Acta Inf., 2013

Cost-benefit analysis of digital rights management products using stochastic models.
Proceedings of the 46th Annual Simulation Symposium, 2013

Causal Structures for General Concurrent Behaviours.
Proceedings of the 22nd International Workshop on Concurrency, 2013

A Taxonomy of Persistent and Nonviolent Steps.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

Step Persistence in the Design of GALS Systems.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

2012
Synthesis Problem for Petri Nets with Localities.
Trans. Petri Nets and Other Models of Concurrency, 2012

Minimal Reaction Systems.
Trans. Computational Systems Biology, 2012

Regions of Petri nets with a/sync connections.
Theor. Comput. Sci., 2012

Localities in systems with a/sync communication.
Theor. Comput. Sci., 2012

Modelling and analysis of biological systems: - Based on papers presented at the Workshop on Membrane Computing and Biologically Inspired Process Calculi (MeCBIC) held in 2008 (Iasi), 2009 (Bologna) and 2010 (Jena).
Theor. Comput. Sci., 2012

Step coverability algorithms for communicating systems.
Sci. Comput. Program., 2012

Membrane Systems and Petri Net Synthesis
Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

Towards Quantitative Analysis of Opacity.
Proceedings of the Trustworthy Global Computing - 7th International Symposium, 2012

A Timed Mobility Semantics Based on Rewriting Strategies.
Proceedings of the Software Engineering and Formal Methods - 10th International Conference, 2012

Modelling Provenance Using Structured Occurrence Networks.
Proceedings of the Provenance and Annotation of Data and Processes, 2012

Behavioural Equivalences over Migrating Processes with Timers.
Proceedings of the Formal Techniques for Distributed Systems, 2012

Relevance of Entities in Reaction Systems.
Proceedings of the Languages Alive, 2012

Hasse Diagrams of Combined Traces.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011
Timed Mobility in process algebra and Petri nets.
J. Log. Algebr. Program., 2011

Membrane Systems with Qualitative Evolution Rules.
Fundam. Inform., 2011

Petri Nets for Biologically Motivated Computing.
Sci. Ann. Comp. Sci., 2011

Petri Nets and Bio-Modelling - and how to benefit from their synergy
CoRR, 2011

Timed Migration and Interaction with Access Permissions.
Proceedings of the FM 2011: Formal Methods, 2011

Causality in Structured Occurrence Nets.
Proceedings of the Dependable and Historic Computing, 2011

Classifying Boolean Nets for Region-based Synthesis.
Proceedings of the Workshop Applications of Region Theory 2011, 2011

The Mutex Paradigm of Concurrency.
Proceedings of the Applications and Theory of Petri Nets - 32nd International Conference, 2011

2010
Minimal Regions of ENL-Transition Systems.
Fundam. Inform., 2010

State Space Reduction for Dynamic Process Creation.
Sci. Ann. Comp. Sci., 2010

Petri Nets with Localities and Testing.
Proceedings of the Applications and Theory of Petri Nets, 2010

Synthesis of General Petri Nets with Localities.
Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), 2010

Modelling Gradients using Petri Nets.
Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), 2010

Quotient Monoids and Concurrent Behaviours.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
A Petri net model for membrane systems with dynamic structure.
Natural Computing, 2009

Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques.
Fundam. Inform., 2009

Synthesis of Nets with Step Firing Policies.
Fundam. Inform., 2009

Synthesis of Petri Nets with Localities.
Sci. Ann. Comp. Sci., 2009

An approach to state space reduction for systems with dynamic process creation.
Proceedings of the 24th International Symposium on Computer and Information Sciences, 2009

Applying Step Coverability Trees to Communicating Component-Based Systems.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
Formal Languages and Concurrent Behaviours.
Proceedings of the New Developments in Formal Languages and Applications, 2008

Processes of membrane systems with promoters and inhibitors.
Theor. Comput. Sci., 2008

Framed temporal logic programming.
Sci. Comput. Program., 2008

Opacity generalised to transition systems.
Int. J. Inf. Sec., 2008

Synthesis of Elementary Net Systems with Context Arcs and Localities.
Fundam. Inform., 2008

A compositional Petri net translation of general pi -calculus terms.
Formal Asp. Comput., 2008

Towards Efficient Verification of Systems with Dynamic Process Creation.
Proceedings of the Theoretical Aspects of Computing, 2008

Modelling and Verification of Timed Interaction and Migration.
Proceedings of the Fundamental Approaches to Software Engineering, 2008

Synthesis of Nets with Step Firing Policies.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007
Processes of Petri Nets with Range Testing.
Fundam. Inform., 2007

Verification of bounded Petri nets using integer programming.
Formal Methods in System Design, 2007

Failures: Their Definition, Modelling and Analysis.
Proceedings of the Theoretical Aspects of Computing, 2007

Synthesis of Elementary Net Systems with Context Arcs and Localities.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

Modelling Mobility in High-level Petri Nets.
Proceedings of the Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007

2006
Process Semantics for Membrane Systems.
Journal of Automata, Languages and Combinatorics, 2006

Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT.
Fundam. Inform., 2006

Petri Net Semantics of the Finite pi-calculus Terms.
Fundam. Inform., 2006

A Petri Net Semantics of a Simple Process Algebra for Mobility.
Electr. Notes Theor. Comput. Sci., 2006

Merged processes: a new condensed representation of Petri net behaviour.
Acta Inf., 2006

On Specification and Verification of Location-Based Fault Tolerant Mobile Systems.
Proceedings of the Rigorous Development of Complex Fault-Tolerant Systems [FP6 IST-511599 RODIN project], 2006

Synchrony and Asynchrony in Membrane Systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

A Petri Net Translation of pi-Calculus Terms.
Proceedings of the Theoretical Aspects of Computing, 2006

Transition Systems of Elementary Net Systems with Localities.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Infinite Process Semantics of Inhibitor Nets.
Proceedings of the Petri Nets and Other Models of Concurrency, 2006

Towards an Algebra of Abstractions for Communicating Processes.
Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005
Modelling Opacity Using Petri Nets.
Electr. Notes Theor. Comput. Sci., 2005

Towards a Petri Net Semantics for Membrane Systems.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Opacity Generalised to Transition Systems.
Proceedings of the Formal Aspects in Security and Trust, Third International Workshop, 2005

Semantics of Framed Temporal Logic Programs.
Proceedings of the Logic Programming, 21st International Conference, 2005

Merged Processes - A New Condensed Representation of Petri Net Behaviour.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
A Framed Temporal Logic Programming Language.
J. Comput. Sci. Technol., 2004

Process semantics of general inhibitor nets.
Inf. Comput., 2004

Detecting State Encoding Conflicts in STG Unfoldings Using SAT.
Fundam. Inform., 2004

Relating Communicating Processes with Different Interfaces.
Fundam. Inform., 2004

Modelling Dynamic Opacity Using Petri Nets with Silent Actions.
Proceedings of the Formal Aspects in Security and Trust: Second IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), 2004

Petri Net Semantics of the Finite pi-Calculus.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT.
Proceedings of the 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 2004

Context-based Process Algebras for Mobility.
Proceedings of the 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 2004

2003
Asynchronous Box Calculus.
Fundam. Inform., 2003

Canonical prefixes of Petri net unfoldings.
Acta Inf., 2003

Branching Processes of High-Level Petri Nets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Detecting State Coding Conflicts in STG Unfoldings Using SAT.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

Process Algebra: A Petri-Net-Oriented Tutorial.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002
The Box Algebra = Petri Nets + Process Expressions.
Inf. Comput., 2002

Parallelisation of the Petri Net Unfolding Algorithm.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

Detecting State Coding Conflicts in STGs Using Integer Programming.
Proceedings of the 2002 Design, 2002

Visualization of Partial Order Models in VLSI Design Flow.
Proceedings of the 2002 Design, 2002

Causality Semantics of Petri Nets with Weighted Inhibitor Arcs.
Proceedings of the CONCUR 2002, 2002

Canonical Prefixes of Petri Net Unfoldings.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

An Algebra of Non-safe Petri Boxes.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Behaviour Abstraction for Communicating Sequential Processes.
Fundam. Inform., 2001

Modelling and verification of an atomic action protocol implemented in Ada.
Comput. Syst. Sci. Eng., 2001

Recursion and Petri nets.
Acta Inf., 2001

Verifying Implementation Relations.
Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

Towards an Efficient Algorithm for Unfolding Petri Nets.
Proceedings of the CONCUR 2001, 2001

Implementing Communicating Processes in the Event of Interface Difference.
Proceedings of the 2nd International Conference on Application of Concurrency to System Design (ACSD 2001), 2001

Petri net algebra.
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04457-5, 2001

2000
LP Deadlock Checking Using Partial Order Dependencies.
Proceedings of the CONCUR 2000, 2000

A Compositional Model of Time Petri Nets.
ICATPN, 2000

Process Semantics of P/T-Nets with Inhibitor Arcs.
ICATPN, 2000

1999
Operational and Denotational Semantics for the Box Algebra.
Theor. Comput. Sci., 1999

Peter Lauer and COSY.
Fundam. Inform., 1999

On Causality Semantics of Nets with Priorities.
Fundam. Inform., 1999

A Model of Behaviour Abstraction for Communicating Processes.
Proceedings of the STACS 99, 1999

The Box Algebra - A Model of Nets and Process Expressions.
Proceedings of the Application and Theory of Petri Nets 1999, 1999

1998
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus.
Proceedings of the Application and Theory of Petri Nets 1998, 1998

Recursive Nets in the Box Algebra.
Proceedings of the 1st International Conference on Application of Concurrency to System Design (ACSD '98), 1998

1997
Two Implementation Relations and the Correctness of Communicating Replicated Processes.
Formal Asp. Comput., 1997

Fundamentals of Modelling Concurrency Using Discrete Relational Structures.
Acta Inf., 1997

1996
Petri Nets, Process Algebras and Concurrent Programming Languages.
Proceedings of the Lectures on Petri Nets II: Applications, 1996

1995
Semantics of Inhibitor Nets.
Inf. Comput., 1995

Using net refinement to compute the fixpoint of a recursive.
Electr. Notes Theor. Comput. Sci., 1995

On compositionality and Petri nets in protocol engineering.
Proceedings of the Protocol Specification, 1995

Solving Recursive Net Equations.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

A Refined View of the Box Algebra.
Proceedings of the Application and Theory of Petri Nets 1995, 1995

1994
Representations of Discrete Interval Orders and Semi-Orders.
Elektronische Informationsverarbeitung und Kybernetik, 1994

Deriving Histories of Nets with Priority Relation.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

Projection in Temporal Logic Programming.
Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Operational Semantics for the Petri Box Calculus.
Proceedings of the CONCUR '94, 1994

Partial Order Semantics of Box Expressions.
Proceedings of the Application and Theory of Petri Nets 1994, 1994

1993
Structure of Concurrency.
Theor. Comput. Sci., 1993

Modelling Replicated Processing.
Proceedings of the PARLE '93, 1993

Order Structures and Generalisations of Szpilrajn's Theorem.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
Adequacy-Preserving Transformations of COSY Path Programs.
Theor. Comput. Sci., 1992

Petri Net Semantics of Priority Systems.
Theor. Comput. Sci., 1992

Invariants and paradigms of concurrency theory.
Future Generation Comp. Syst., 1992

Modelling systems with dynamic priorities.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991
Axiom system induced by CTL* Logic.
Fundam. Inform., 1991

Formalising Replicated Distributed Processing.
Proceedings of the Tenth Symposium on Reliable Distributed Systems, 1991

Invariants and Paradigms of Concurrency Theory.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Invariant Semantics of Nets with Inhibitor Arcs.
Proceedings of the CONCUR '91, 1991

Structure of Concurrency.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
On Some Implementation of Optimal Simulations.
Proceedings of the Computer-Aided Verification, 1990

Using Optimal Simulations to Reduce Reachability Graphs.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

Optimal simulations, nets and reachability graphs.
Proceedings of the Advances in Petri Nets 1991, 1990

1989
Synchronizing events in replicated systems.
Journal of Systems and Software, 1989

Towards A Theory Of Simulation For Verification Of Concurrent Systems.
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

1988
Adequacy-Preserving Transformations of COSY Path Programs.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

1986
Concurrent and Maximally Concurrent Evolution of Nonsequential Systems.
Theor. Comput. Sci., 1986

The Merlin-Randell Problem of Train Journeys.
Acta Inf., 1986

On equivalent execution semantics of concurrent systems.
Proceedings of the Advances in Petri Nets 1987, 1986

Formal specification of N-modular redundancy.
Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

1985
Identification of Regular Configurations with Partial Information.
International Journal of Man-Machine Studies, 1985

1984
On the Merlin-Randell Problem of Train Journeys.
Proceedings of the International Symposium on Programming, 1984


  Loading...