Ryszard Janicki

According to our database1, Ryszard Janicki authored at least 111 papers between 1976 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Interval semantics for Petri nets with inhibitor arcs.
Theor. Comput. Sci., 2018

Approximations of arbitrary relations by partial orders.
Int. J. Approx. Reasoning, 2018

Modeling Operational Semantics with Interval Orders Represented by Sequences of Antichains.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Modeling concurrency with interval traces.
Inf. Comput., 2017

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

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

Yet Another Kind of Rough Sets Induced by Coverings.
Proceedings of the Rough Sets - International Joint Conference, 2017

datumPIPE: Data Generator and Corrupter for Multiple Data Quality Aspects.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 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
Optimal approximations with Rough Sets and similarities in measure spaces.
Int. J. Approx. Reasoning, 2016

Preface.
Fundam. Inform., 2016

Step traces.
Acta Inf., 2016

On Optimal Approximations of Arbitrary Relations by Partial Orders.
Proceedings of the Rough Sets - International Joint Conference, 2016

On Approximation of Relations by Generalized Closures and Generalized Kernels.
Proceedings of the Rough Sets - International Joint Conference, 2016

2015
Characterising Concurrent Histories.
Fundam. Inform., 2015

On Classification with Pairwise Comparisons, Support Vector Machines and Feature Domain Overlapping.
Comput. J., 2015

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

On Interval Process Semantics of Petri Nets with Inhibitor Arcs.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2015

2013
Property-Driven Rough Sets Approximations of Relations.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Weighted Features Classification with Pairwise Comparisons, Support Vector Machines and Feature Domain Overlapping.
Proceedings of the 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2013

On Pairwise Comparisons Based Internal and External Measures for Software Evaluation.
Proceedings of the 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2013

Optimal Approximations with Rough Sets.
Proceedings of the Rough Sets and Knowledge Technology - 8th International Conference, 2013

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

2012
On a pairwise comparison-based consistent non-numerical ranking.
Logic Journal of the IGPL, 2012

Optimization of Quadtree Representation and Compression.
Proceedings of the Rough Sets and Current Trends in Computing, 2012

Modeling Interval Order Structures with Partially Commutative Monoids.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models.
Trans. Rough Sets, 2011

Modelling concurrency with comtraces and generalized comtraces.
Inf. Comput., 2011

Preface.
Fundam. Inform., 2011

Remarks on Pairwise Comparison Numerical and Non-numerical Rankings.
Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

2010
Preserving Consistency and Properties in Pairwise Comparisons Based Non-Numerical Ranking.
Proceedings of the 2010 International Conference on Software Engineering Research & Practice, 2010

Selecting the best strategy in a software certification process.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2010

On Consistency in Pairwise Comparisons Based Numerical and Non-Numerical Ranking.
Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

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

2009
Pairwise Comparisons Based Non-Numerical Ranking.
Fundam. Inform., 2009

Modelling Concurrency with Comtraces and Generalized Comtraces
CoRR, 2009

Proving Properties of Programs with Theorem Provers - Experiments with Z3 and Simplify.
Proceedings of the 2009 International Conference on Software Engineering Research & Practice, 2009

Tabular Expressions vs Software Cost Reduction.
Proceedings of the 2009 International Conference on Software Engineering Research & Practice, 2009

Benefits of Using Tabular Expressions in Planning Health Services.
Proceedings of the 2009 International Conference on Software Engineering Research & Practice, 2009

On Rough Sets with Structures and Properties.
Proceedings of the Rough Sets, 2009

Closure Operators for Order Structures.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

On Closure Operator for Interval Order Structures.
Proceedings of the 2009 International Conference on Foundations of Computer Science, 2009

2008
A Categorical Approach to Mereology and Its Application to Modelling Software Components.
Trans. Rough Sets, 2008

Relational structures model of concurrency.
Acta Inf., 2008

Ranking with Partial Orders and Pairwise Comparisons.
Proceedings of the Rough Sets and Knowledge Technology, Third International Conference, 2008

Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders.
Proceedings of the Rough Sets and Current Trends in Computing, 2008

Modelling Concurrency with Quotient Monoids.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007
Towards a Pragmatic Mereology.
Fundam. Inform., 2007

Computing Properties of Numerical Imperative Programs by Symbolic Computation.
Fundam. Inform., 2007

Pairwise Comparisons, Incomparability and Partial Orders.
Proceedings of the ICEIS 2007, 2007

Attacking the Web Cancer with the Automatic Understanding Approach.
Proceedings of the Advances in Intelligent Web Mastering, Proceedings of the 5th Atlantic Web Intelligence Conference - AWIC 2007, Fontainebleau, France, June 25, 2007

2006
Special Issueon Application of Concurrency to System Design.
Fundam. Inform., 2006

On a Parthood Specification Method for Component Software.
Proceedings of the Rough Sets and Current Trends in Computing, 2006

2005
Tabular Expressions and Their Relational Semantics.
Fundam. Inform., 2005

Basic Mereology with Equivalence Relations.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Preface.
Fundam. Inform., 2004

Modelling Concurrency with Tabular Expressions.
Proceedings of the International Conference on Software Engineering Research and Practice, 2004

On Properties of 'Part of' Relations.
Proceedings of the International Conference on Software Engineering Research and Practice, 2004

Verification of the WAP Transaction Layer.
Proceedings of the 2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 2004

A Generalisation of a Relational Structures Model of Concurrency.
Proceedings of the Theoretical Aspects of Computing, 2004

Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN.
Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research, 2004

2003
On tabular expressions.
Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative Research, 2003

2002
Towards a Mereological System for Direct Products and Relations.
Proceedings of the Rough Sets and Current Trends in Computing, 2002

On Concurrency Control in Object-oriented Databases.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2002

On a Mereological System for Relational Software Specifications.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

A simplistic Mereological System for Relations.
Proceedings of the International Conference on Artificial Intelligence, 2002

Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Foundations of the Trace Assertion Method of Module Interface Specification.
IEEE Trans. Software Eng., 2001

On a formal semantics of tabular expressions.
Sci. Comput. Program., 2001

2000
On Trace Assertion Method of Module Interface Specification with Concurrency.
Proceedings of the Rough Sets and Current Trends in Computing, 2000

Remarks on Mereology of Relations.
Proceedings of the Participants Copies of Fifth International Seminar on Relational Methods in Computer Science, 2000

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

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

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

Towards a Formal Semantics of Parnas Tables.
Proceedings of the 17th International Conference on Software Engineering, 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

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

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

1992
Specification and Analysis of Concurrent Systems - The COSY Approach
EATCS Monographs on Theoretical Computer Science, Springer, ISBN: 978-3-642-77337-2, 1992

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

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
Transformations of Sequential Specifications into Concurrent Specifications by Synchronization Guards.
Theor. Comput. Sci., 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

A Simple Realization of a Parallel Device Recognizing Regular Trace Languages.
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

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

Complete Sequential Specification Allows for Concurrent Execution.
Proceedings of the Computer Trends in the 1990s, 1989

1988
On the Semantics Of Priority Systems.
Proceedings of the International Conference on Parallel Processing, 1988

How to relieve a programmer from synchronization details.
Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987
A Formal Semantics for Concurrent Systems with a Priority Relation.
Acta Inf., 1987

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

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

1985
Transforming Sequential Systems into Concurrent Systems.
Theor. Comput. Sci., 1985

An Equivalence Notion for Path Expressions Systems.
Elektronische Informationsverarbeitung und Kybernetik, 1985

1984
Nets, Sequential Components and Concurrency Relations.
Theor. Comput. Sci., 1984

A Method for Developing Concurrent Systems.
Proceedings of the International Symposium on Programming, 1984

Maximally Concurrent Evolution of Non-sequential Systems.
Proceedings of the Seminar on Concurrency, 1984

1981
A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency Relations.
Proceedings of the Formalization of Programming Concepts, 1981

On the Design of Concurrent Systems.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980
Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them.
Fundam. Inform., 1980

An Algebraic Structure of Petri Nets.
Proceedings of the International Symposium on Programming, 1980

On Atomic Nets and Concurrency Relations.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
A Characterization of Concurrency-Like Relations.
Proceedings of the Semantics of Concurrent Computation, 1979

Analysis of vectors of coroutines by means of components.
FCT, 1979

1978
Synthesis of Concurrent Schemes.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Vectors of Coroutines over Blikle Nets.
FCT, 1977

1976
Vectors of Coroutines.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976


  Loading...