| 2008 | ||
|---|---|---|
| 102 | Jonathan Billington, Zhenhua Duan, Maciej Koutny: 8th International Conference on Application of Concurrency to System Design (ACSD 2008), Xi'an, China, June 23-27, 2008 IEEE 2008 | |
| 101 | Gabriel Ciobanu, Maciej Koutny: Modelling and Verification of Timed Interaction and Migration. FASE 2008: 215-229 | |
| 100 | Hanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau: Towards Efficient Verification of Systems with Dynamic Process Creation. ICTAC 2008: 186-200 | |
| 99 | Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev: Synthesis of Nets with Step Firing Policies. Petri Nets 2008: 112-131 | |
| 98 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: A compositional Petri net translation of general pi -calculus terms. Formal Asp. Comput. 20(4-5): 429-450 (2008) | |
| 97 | Maciej Koutny, Marta Pietkiewicz-Koutny: Synthesis of Elementary Net Systems with Context Arcs and Localities. Fundam. Inform. 88(3): 307-328 (2008) | |
| 96 | Jeremy Bryans, Maciej Koutny, Laurent Mazaré, Peter Y. A. Ryan: Opacity generalised to transition systems. Int. J. Inf. Sec. 7(6): 421-435 (2008) | |
| 95 | Zhenhua Duan, Xiaoxiao Yang, Maciej Koutny: Framed temporal logic programming. Sci. Comput. Program. 70(1): 31-61 (2008) | |
| 94 | Jetty Kleijn, Maciej Koutny: Processes of membrane systems with promoters and inhibitors. Theor. Comput. Sci. 404(1-2): 112-126 (2008) | |
| 2007 | ||
| 93 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Modelling Mobility in High-level Petri Nets. ACSD 2007: 110-119 | |
| 92 | Maciej Koutny, Marta Pietkiewicz-Koutny: Synthesis of Elementary Net Systems with Context Arcs and Localities. ICATPN 2007: 281-300 | |
| 91 | Brian Randell, Maciej Koutny: Failures: Their Definition, Modelling and Analysis. ICTAC 2007: 260-274 | |
| 90 | Victor Khomenko, Maciej Koutny: Verification of bounded Petri nets using integer programming. Formal Methods in System Design 30(2): 143-176 (2007) | |
| 89 | Jetty Kleijn, Maciej Koutny: Processes of Petri Nets with Range Testing. Fundam. Inform. 80(1-3): 199-219 (2007) | |
| 2006 | ||
| 88 | Maciej Koutny, Giuseppe Pappalardo, Marta Pietkiewicz-Koutny: Towards an Algebra of Abstractions for Communicating Processes. ACSD 2006: 239-250 | |
| 87 | Maciej Koutny, Marta Pietkiewicz-Koutny: Transition Systems of Elementary Net Systems with Localities. CONCUR 2006: 173-187 | |
| 86 | H. C. M. Kleijn, Maciej Koutny: Infinite Process Semantics of Inhibitor Nets. ICATPN 2006: 282-301 | |
| 85 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: A Petri Net Translation of pi-Calculus Terms. ICTAC 2006: 138-152 | |
| 84 | Alexei Iliasov, Victor Khomenko, Maciej Koutny, Alexander Romanovsky: On Specification and Verification of Location-Based Fault Tolerant Mobile Systems. RODIN Book 2006: 168-188 | |
| 83 | Jetty Kleijn, Maciej Koutny: Synchrony and Asynchrony in Membrane Systems. Workshop on Membrane Computing 2006: 66-85 | |
| 82 | Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler: Merged processes: a new condensed representation of Petri net behaviour. Acta Inf. 43(5): 307-330 (2006) | |
| 81 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: A Petri Net Semantics of a Simple Process Algebra for Mobility. Electr. Notes Theor. Comput. Sci. 154(3): 71-94 (2006) | |
| 80 | Victor Khomenko, Maciej Koutny, Alexandre Yakovlev: Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT. Fundam. Inform. 70(1-2): 49-73 (2006) | |
| 79 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Petri Net Semantics of the Finite pi-calculus Terms. Fundam. Inform. 70(3): 203-226 (2006) | |
| 78 | Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg: Process Semantics for Membrane Systems. Journal of Automata, Languages and Combinatorics 11(3): 321-340 (2006) | |
| 2005 | ||
| 77 | Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler: Merged Processes - A New Condensed Representation of Petri Net Behaviour. CONCUR 2005: 338-352 | |
| 76 | Jeremy Bryans, Maciej Koutny, Laurent Mazaré, Peter Y. A. Ryan: Opacity Generalised to Transition Systems. Formal Aspects in Security and Trust 2005: 81-95 | |
| 75 | Zhenhua Duan, Xiaoxiao Yang, Maciej Koutny: Semantics of Framed Temporal Logic Programs. ICLP 2005: 356-370 | |
| 74 | Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg: Towards a Petri Net Semantics for Membrane Systems. Workshop on Membrane Computing 2005: 292-309 | |
| 73 | Jeremy Bryans, Maciej Koutny, Peter Y. A. Ryan: Modelling Opacity Using Petri Nets. Electr. Notes Theor. Comput. Sci. 121: 101-115 (2005) | |
| 2004 | ||
| 72 | Victor Khomenko, Maciej Koutny, Alexandre Yakovlev: Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT. ACSD 2004: 16-25 | |
| 71 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Context-based Process Algebras for Mobility. ACSD 2004: 79-88 | |
| 70 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Petri Net Semantics of the Finite pi-Calculus. FORTE 2004: 309-325 | |
| 69 | Jeremy Bryans, Maciej Koutny, Peter Y. A. Ryan: Modelling Dynamic Opacity Using Petri Nets with Silent Actions. Formal Aspects in Security and Trust 2004: 159-172 | |
| 68 | Jonathan Burton, Maciej Koutny, Giuseppe Pappalardo: Relating Communicating Processes with Different Interfaces. Fundam. Inform. 59(1): 1-37 (2004) | |
| 67 | Victor Khomenko, Maciej Koutny, Alexandre Yakovlev: Detecting State Encoding Conflicts in STG Unfoldings Using SAT. Fundam. Inform. 62(2): 221-241 (2004) | |
| 66 | H. C. M. Kleijn, Maciej Koutny: Process semantics of general inhibitor nets. Inf. Comput. 190(1): 18-69 (2004) | |
| 65 | Zhenhua Duan, Maciej Koutny: A Framed Temporal Logic Programming Language. J. Comput. Sci. Technol. 19(3): 341-351 (2004) | |
| 2003 | ||
| 64 | Victor Khomenko, Maciej Koutny, Alexandre Yakovlev: Detecting State Coding Conflicts in STG Unfoldings Using SAT. ACSD 2003: 51-60 | |
| 63 | Eike Best, Maciej Koutny: Process Algebra: A Petri-Net-Oriented Tutorial. Lectures on Concurrency and Petri Nets 2003: 180-209 | |
| 62 | Victor Khomenko, Maciej Koutny: Branching Processes of High-Level Petri Nets. TACAS 2003: 458-472 | |
| 61 | Victor Khomenko, Maciej Koutny, Walter Vogler: Canonical prefixes of Petri net unfoldings. Acta Inf. 40(2): 95-118 (2003) | |
| 60 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau: Asynchronous Box Calculus. Fundam. Inform. 54(4): 295-344 (2003) | |
| 2002 | ||
| 59 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau: An Algebra of Non-safe Petri Boxes. AMAST 2002: 192-207 | |
| 58 | Victor Khomenko, Maciej Koutny, Walter Vogler: Canonical Prefixes of Petri Net Unfoldings. CAV 2002: 582-595 | |
| 57 | H. C. M. Kleijn, Maciej Koutny: Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. CONCUR 2002: 531-546 | |
| 56 | Alexandre V. Bystrov, Maciej Koutny, Alexandre Yakovlev: Visualization of Partial Order Models in VLSI Design Flow. DATE 2002: 1089 | |
| 55 | Victor Khomenko, Maciej Koutny, Alexandre Yakovlev: Detecting State Coding Conflicts in STGs Using Integer Programming. DATE 2002: 338-345 | |
| 54 | Keijo Heljanko, Victor Khomenko, Maciej Koutny: Parallelisation of the Petri Net Unfolding Algorithm. TACAS 2002: 371-385 | |
| 53 | Eike Best, Raymond R. Devillers, Maciej Koutny: The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178(1): 44-100 (2002) | |
| 2001 | ||
| 52 | José Manuel Colom, Maciej Koutny: Application and Theory of Petri Nets 2001, 22nd International Conference, ICATPN 2001, Newcastle upon Tyne, UK, June 25-29, 2001, Proceedings Springer 2001 | |
| 51 | Jonathan Burton, Maciej Koutny, Giuseppe Pappalardo: Implementing Communicating Processes in the Event of Interface Difference. ACSD 2001: 87- | |
| 50 | Victor Khomenko, Maciej Koutny: Towards an Efficient Algorithm for Unfolding Petri Nets. CONCUR 2001: 366-380 | |
| 49 | Jonathan Burton, Maciej Koutny, Giuseppe Pappalardo: Verifying Implementation Relations. FME 2001: 364-383 | |
| 48 | Eike Best, Raymond R. Devillers, Maciej Koutny: Recursion and Petri nets. Acta Inf. 37(11-12): 781-829 (2001) | |
| 47 | Alan Burns, Andy J. Wellings, Frank P. Burns, Albert Koelmans, Maciej Koutny, Alexander B. Romanovsky, Alexandre Yakovlev: Modelling and verification of an atomic action protocol implemented in Ada. Comput. Syst. Sci. Eng. 16(3): 173-182 (2001) | |
| 46 | Maciej Koutny, Giuseppe Pappalardo: Behaviour Abstraction for Communicating Sequential Processes. Fundam. Inform. 48(1): 21-54 (2001) | |
| 2000 | ||
| 45 | Victor Khomenko, Maciej Koutny: LP Deadlock Checking Using Partial Order Dependencies. CONCUR 2000: 410-425 | |
| 44 | H. C. M. Kleijn, Maciej Koutny: Process Semantics of P/T-Nets with Inhibitor Arcs. ICATPN 2000: 261-281 | |
| 43 | Maciej Koutny: A Compositional Model of Time Petri Nets. ICATPN 2000: 303-322 | |
| 1999 | ||
| 42 | Eike Best, Raymond R. Devillers, Maciej Koutny: The Box Algebra - A Model of Nets and Process Expressions. ICATPN 1999: 344-363 | |
| 41 | Maciej Koutny, Giuseppe Pappalardo: A Model of Behaviour Abstraction for Communicating Processes. STACS 1999: 313-322 | |
| 40 | Ryszard Janicki, Maciej Koutny: On Causality Semantics of Nets with Priorities. Fundam. Inform. 38(3): 223-255 (1999) | |
| 39 | Maciej Koutny: Peter Lauer and COSY. Fundam. Inform. 40(2-3): 103-107 (1999) | |
| 38 | Maciej Koutny, Eike Best: Operational and Denotational Semantics for the Box Algebra. Theor. Comput. Sci. 211(1-2): 1-83 (1999) | |
| 1998 | ||
| 37 | Raymond R. Devillers, Maciej Koutny: Recursive Nets in the Box Algebra. ACSD 1998: 239-249 | |
| 36 | Martin Hesketh, Maciej Koutny: An Axiomatisation of Duplication Equivalence in the Petri Box Calculus. ICATPN 1998: 165-184 | |
| 1997 | ||
| 35 | Ryszard Janicki, Maciej Koutny: Fundamentals of Modelling Concurrency Using Discrete Relational Structures. Acta Inf. 34(5): 367-388 (1997) | |
| 34 | Maciej Koutny, Luigi V. Mancini, Giuseppe Pappalardo: Two Implementation Relations and the Correctness of Communicating Replicated Processes. Formal Asp. Comput. 9(2): 119-148 (1997) | |
| 1996 | ||
| 33 | Eike Best, Raymond R. Devillers, Maciej Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) 1996: 1-84 | |
| 1995 | ||
| 32 | Eike Best, Maciej Koutny: A Refined View of the Box Algebra. Application and Theory of Petri Nets 1995: 1-20 | |
| 31 | Eike Best, Maciej Koutny: Solving Recursive Net Equations. ICALP 1995: 605-623 | |
| 30 | Nikolay A. Anisimov, Maciej Koutny: On compositionality and Petri nets in protocol engineering. PSTV 1995: 71-86 | |
| 29 | Eike Best, Maciej Koutny: Using net refinement to compute the fixpoint of a recursive. Electr. Notes Theor. Comput. Sci. 2: (1995) | |
| 28 | Ryszard Janicki, Maciej Koutny: Semantics of Inhibitor Nets. Inf. Comput. 123(1): 1-16 (1995) | |
| 1994 | ||
| 27 | Maciej Koutny: Partial Order Semantics of Box Expressions. Application and Theory of Petri Nets 1994: 318-337 | |
| 26 | Maciej Koutny, Javier Esparza, Eike Best: Operational Semantics for the Petri Box Calculus. CONCUR 1994: 210-225 | |
| 25 | Zhenhua Duan, Maciej Koutny, Chris Holt: Projection in Temporal Logic Programming. LPAR 1994: 333-344 | |
| 24 | Ryszard Janicki, Maciej Koutny: Deriving Histories of Nets with Priority Relation. PARLE 1994: 623-634 | |
| 23 | Ryszard Janicki, Maciej Koutny: Representations of Discrete Interval Orders and Semi-Orders. Elektronische Informationsverarbeitung und Kybernetik 30(3): 161-168 (1994) | |
| 1993 | ||
| 22 | Ryszard Janicki, Maciej Koutny: Order Structures and Generalisations of Szpilrajn's Theorem. FSTTCS 1993: 348-357 | |
| 21 | Maciej Koutny, Luigi V. Mancini, Giuseppe Pappalardo: Modelling Replicated Processing. PARLE 1993: 672-675 | |
| 20 | Ryszard Janicki, Maciej Koutny: Structure of Concurrency. Theor. Comput. Sci. 112(1): 5-52 (1993) | |
| 1992 | ||
| 19 | Maciej Koutny: Modelling systems with dynamic priorities. Advances in Petri Nets: The DEMON Project 1992: 251-266 | |
| 18 | Maciej Koutny: Adequacy-Preserving Transformations of COSY Path Programs. Theor. Comput. Sci. 94(1): 141-158 (1992) | |
| 17 | Eike Best, Maciej Koutny: Petri Net Semantics of Priority Systems. Theor. Comput. Sci. 96(1): 175-174 (1992) | |
| 1991 | ||
| 16 | Ryszard Janicki, Maciej Koutny: Structure of Concurrency. AMAST 1991: 98-107 | |
| 15 | Ryszard Janicki, Maciej Koutny: Invariant Semantics of Nets with Inhibitor Arcs. CONCUR 1991: 317-331 | |
| 14 | Ryszard Janicki, Maciej Koutny: Invariants and Paradigms of Concurrency Theory. PARLE (2) 1991: 59-74 | |
| 13 | Maciej Koutny, Luigi V. Mancini, Giuseppe Pappalardo: Formalising Replicated Distributed Processing. SRDS 1991: 108-117 | |
| 12 | Maciej Koutny: Axiom system induced by CTL* Logic. Fundam. Inform. 14(2): 235-253 (1991) | |
| 1990 | ||
| 11 | Ryszard Janicki, Maciej Koutny: Optimal simulations, nets and reachability graphs. Applications and Theory of Petri Nets 1990: 205-226 | |
| 10 | Ryszard Janicki, Maciej Koutny: Using Optimal Simulations to Reduce Reachability Graphs. CAV 1990: 166-175 | |
| 1989 | ||
| 9 | Ryszard Janicki, Maciej Koutny: Towards A Theory Of Simulation For Verification Of Concurrent Systems. PARLE (2) 1989: 73-88 | |
| 8 | Maciej Koutny, Luigi V. Mancini: Synchronizing events in replicated systems. Journal of Systems and Software 9(3): 183-190 (1989) | |
| 1988 | ||
| 7 | Maciej Koutny: Adequacy-Preserving Transformations of COSY Path Programs. Concurrency 1988: 368-379 | |
| 1986 | ||
| 6 | Luigi V. Mancini, Maciej Koutny: Formal specification of N-modular redundancy. ACM Conference on Computer Science 1986: 199-204 | |
| 5 | Ryszard Janicki, Maciej Koutny: On equivalent execution semantics of concurrent systems. European Workshop on Applications and Theory of Petri Nets 1986: 89-103 | |
| 4 | Maciej Koutny: The Merlin-Randell Problem of Train Journeys. Acta Inf. 23(4): 429-463 (1986) | |
| 3 | Ryszard Janicki, Peter E. Lauer, Maciej Koutny, Raymond R. Devillers: Concurrent and Maximally Concurrent Evolution of Nonsequential Systems. Theor. Comput. Sci. 43: 213-238 (1986) | |
| 1985 | ||
| 2 | Wojciech Zakowski, Maciej Koutny: Identification of Regular Configurations with Partial Information. International Journal of Man-Machine Studies 22(5): 581-587 (1985) | |
| 1984 | ||
| 1 | Maciej Koutny: On the Merlin-Randell Problem of Train Journeys. Symposium on Programming 1984: 179-190 | |